Linear Programming and Community Detection
نویسندگان
چکیده
The problem of community detection with two equal-sized communities is closely related to the minimum graph bisection over certain random models. In stochastic block model distribution networks structure, a well-known semidefinite programming (SDP) relaxation recovers underlying whenever possible. Motivated by their superior scalability, we study theoretical performance linear (LP) relaxations for same We show that, unlike SDP that undergoes phase transition in logarithmic average degree regime, LP fails recovering planted high probability this regime. instead exhibits from recovery nonrecovery Finally, present conditions graphs strictly between and logarithmic. Funding: A. Del Pia partially funded Office Naval Research (ONR) [Grant N00014-19-1-2322]. D. Kunisky supported ONR N00014-20-1-2335], Simons Investigator Award Daniel Spielman, National Science Foundation [Grants DMS-1712730 DMS-1719545].
منابع مشابه
Solving fully fuzzy linear programming
In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear programming (abbreviated to FFLP) problems. Also, we employ linear programming (LP) with equality constraints to find a nonegative fuzzy number vector x which satisfies Ax =b, where A is a fuzzy number matrix. Then we investigate the existence of a positive solution of fully fuzzy linear system (FFLS).
متن کاملA Linear Programming Approach to Novelty Detection
Novelty detection involves modeling the normal behaviour of a system hence enabling detection of any divergence from normality. It has potential applications in many areas such as detection of machine damage or highlighting abnormal features in medical data. One approach is to build a hypothesis estimating the support of the normal data i.e. constructing a function which is positive in the regi...
متن کاملLinear Programming and Integer Linear Programming
5 Algorithms 8 5.1 Fourier-Motzkin Elimination . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.2 The Simplex Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.3 Seidel’s Randomized Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.4 The Ellipsoid Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.5 Using the Ellipsoid...
متن کاملA goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملFirst step immersion in interval linear programming with linear dependencies
We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals. Contrary to classical models, where parameters can attain any value from the interval domains independently, we study problems with linear dependencies between the parameters. We present a class of problems that are easily solved by reduction to the classi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2023
ISSN: ['0364-765X', '1526-5471']
DOI: https://doi.org/10.1287/moor.2022.1282